翻訳と辞書 Words near each other ・ Fiberscope ・ FiberSkyn ・ Fibertel ・ Fibes Drums ・ Fibes, Oh Fibes! ・ Fibex ・ Fibiger (crater) ・ Fibigia ・ Fibigia clypeata ・ Fibis ・ Fibiș ・ Fibiș River ・ Fibla carpenteri ・ FIBO Power Pro Germany ・ Fibonacci ・ Fibonacci coding ・ Fibonacci cube ・ Fibonacci heap ・ Fibonacci number ・ Fibonacci numbers in popular culture ・ Fibonacci polynomials ・ Fibonacci prime ・ Fibonacci Quarterly ・ Fibonacci quasicrystal ・ Fibonacci retracement ・ Fibonacci search technique ・ Fibonacci word ・ Fibonacci's identity ・ Fibonomial coefficient ・ Fibonorial Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Fibonacci coding ： ウィキペディア英語版 Fibonacci coding In mathematics and computing, Fibonacci coding is a universal code which encodes positive integers into binary code words. It is one example of representations of integers based on Fibonacci numbers. Each code word ends with "11" and contains no other instances of "11" before the end. The Fibonacci code is closely related to the ''Zeckendorf representation'', a positional numeral system that uses Zeckendorf's theorem and has the property that no number has a representation with consecutive 1s. The Fibonacci code word for a particular integer is exactly the integer's Zeckendorf representation with the order of its digits reversed and an additional "1" appended to the end. ==Definition== For a number $N\backslash !$, if $d(0),d(1),\backslash ldots,d(k-1),d(k)\backslash !$ represent the digits of the code word representing $N\backslash !$ then we have: : $N\; =\; \backslash sum\_^\; d(i)\; F(i+2),\backslash textd(k-1)=d(k)=1.\backslash !$ where is the th Fibonacci number, and so is the th distinct Fibonacci number starting with $1,2,3,5,8,13,\backslash ldots$. The last bit $d(k)$ is always an appended bit of 1 and does not carry place value. It can be shown that such a coding is unique, and the only occurrence of "11" in any code word is at the end i.e. ''d''(''k''−1) and ''d''(''k''). Note that the penultimate bit is the most significant bit and the first bit is the least significant bit. Note also that leading zeros cannot be omitted as they can in e.g. decimal numbers. The first few Fibonacci codes are shown below, and also the so-called ''implied distribution'', the distribution of values for which Fibonacci coding gives a minimum-size code. To encode an integer ''N'': # Find the largest Fibonacci number equal to or less than ''N''; subtract this number from ''N'', keeping track of the remainder. # If the number subtracted was the ''i''th Fibonacci number ''F''(''i''), put a 1 in place ''i''−2 in the code word (counting the left most digit as place 0). # Repeat the previous steps, substituting the remainder for ''N'', until a remainder of 0 is reached. # Place an additional 1 after the rightmost digit in the code word. To decode a code word, remove the final "1", assign the remaining the values 1,2,3,5,8,13... (the Fibonacci numbers) to the bits in the code word, and sum the values of the "1" bits. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Fibonacci coding」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.